Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Live A Tasmanis,

Welcome back to the, what is it, the fifth, I think, week of AI.

We've managed to finish last week the kind of big chapter that we call general problem

solving, which is a slightly more enlightened way of thinking about it, is AI algorithms

with atomic states.

Essentially all of those are, or were tree search algorithms.

We kind of saw the basic version for searching.

We saw the informed search, which is search with heuristics, where we had exactly one

algorithm essentially left over that was a star.

We looked at local search when everything is too difficult for systematic search.

And finally we looked at game playing.

Game playing as two person search.

We have a tree search algorithm where the searcher only has control over half of the

layers.

Mini maxi, mini maxi, mini maxi, mini max.

And we saw something that is paradigmatic, namely a pruning technique.

Pruning as being a technique where you basically delete certain parts of the search space,

making the search tree skinnier, which means we can look further down.

And alpha beta pruning, even though it's a very simple idea, gives us in the best case

double as far looking down.

Okay.

So that was what we can do essentially with atomic states.

Remember that this course is just a kind of a tour through the AI vegetable garden looking

at every plant, sniffing at every blossom.